Ends in free minimal spanning forests

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ends in Uniform Spanning Forests

It has hitherto been known that in a transitive unimodular graph, each tree in the wired spanning forest has only one end a.s. We dispense with the assumptions of transitivity and unimodularity, replacing them with a much broader condition on the isoperimetric profile that requires just slightly more than uniform transience. §

متن کامل

Minimal spanning forests

We study minimal spanning forests in infinite graphs, which are weak limits of minimal spanning trees from finite subgraphs corresponding to i.i.d. random labels on the edges. These limits can be taken with free or wired boundary conditions, and are denoted FMSF (free minimal spanning forest) and WMSF (wired minimal spanning forest), respectively. The WMSF is also the union of the trees that ar...

متن کامل

Ends in Uniform Spanning Forests 1

It has hitherto been known that in a transitive unimodular graph, each tree in the wired spanning forest has only one end a.s. We dispense with the assumptions of transitivity and unimodularity, replacing them with a much broader condition on the isoperimetric profile that requires just slightly more than uniform transience.

متن کامل

Finding Minimal Spanning Forests in a Grap

We propose two algorithms for solving a graph partitioning problem motivated by computational topology. Specifically, given a weighted, undirected graph G and a positive integer k, we desire to find k disjoint trees within G such that each vertex of G is contained in one of the trees and the weight of largest tree is as small as possible. We are unable to find this problem in the graph partitio...

متن کامل

Percolation and Minimal Spanning Forests in Infinite Graphs

JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact [email protected].. Institute of Mathematical Statistics is collaborating wit...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Annals of Probability

سال: 2006

ISSN: 0091-1798

DOI: 10.1214/009117906000000025